منابع مشابه
Qualitative Systems Identification for Linear Time Invariant Dynamic Systems
The problem of Systems Identification starts with a timeseries of observed data and tries to determine the simplest model capable of exhibiting the observed behavior. This optimization problem searches the model from a space of possible models. In traditional methods, the search space is the set of numerical values to be assigned to parameters. In our approach we are constrained, and therefore ...
متن کاملIdentification of linear dynamic systems operating in a networked environment
This paper studies a networked system identification problem, which aims at identifying mathematical models required in networked control/estimation/filtering systems. Specifically, we consider the off-line identification of open-loop stable linear time-invariant processes working in a networked environment. In the networked environment, how the actuators (D/A conversion) operate plays a key ro...
متن کاملUnderlying Linear System Identification of Memoryless and Dynamic Nonlinear Systems
The Bussgang coefficient is calculated for a memoryless nonlinear system and the concept extended to a dynamic system modeled by a Volterra Series and for Gaussian Inputs. The theory obtained is then applied to a simple system and the underlying linear system obtained for different system configurations.
متن کاملGeneral Realization Algorithm for Modal Identification of Linear Dynamic Systems
The general realization algorithm GRA is developed to identify modal parameters of linear multi-degree-of-freedom dynamic systems subjected to measured known arbitrary dynamic loading from known initial conditions. The GRA extends the well known eigensystem realization algorithm ERA based on Hankel matrix decomposition by allowing an arbitrary input signal in the realization algorithm. This gen...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1965
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(65)90299-8